Robust Knowledge of Rationality

نویسنده

  • Sergei Artemov
چکیده

Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Stalnaker example is a fit for ‘rationality and common belief of rationality’ rather than ‘common knowledge of rationality.’ In order to represent knowledge in the belief revision setting we introduce the notion of ‘robust knowledge’ which is maintained whenever possible during belief revision. We show that robust knowledge of Stalnaker rationality in games of perfect information yields backward induction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TR-2010007: Robust Knowledge of Rationality

Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Sta...

متن کامل

TR-2010010: Robust Knowledge and Rationality

In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condi...

متن کامل

Robust Knowledge and Rationality

In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condi...

متن کامل

Bounded Rationality and Alternating-Offer Bargaining

One form of bounded rationality is a breakdown in the commonality of the knowledge that the players are rational. In Rubinstein’s two-person alternating-offer bargaining game, assuming time preferences with constant discount factors, common knowledge of rationality is necessary for an agreement on a subgame perfect equilibrium (SPE) partition to be reached (if ever). In this note, assuming time...

متن کامل

Anytime Bounded Rationality

Dependable cyber-physical systems strive to deliver anticipative, multi-objective performance anytime, facing deluges of inputs with varying and limited resources. This is even more challenging for life-long learning rational agents as they also have to contend with the varying and growing know-how accumulated from experience. These issues are of crucial practical value, yet have been only marg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010